Local Model Checking for Value-Passing Processes (Extended Abstract)
نویسندگان
چکیده
We present a rst-order modal-calculus which uses parameterised maximal x-points to describe safety and liveness properties of processes. Then we give a local model checking proof system for deciding if a process satisses such a formula. The processes we consider are those deenable in regular value-passing CCS with parameterised recursive deenitions. Certain rules in the proof system carry side conditions which leave auxiliary proof obligations of checking properties of the data language. The proof system is incomplete in general, but we show, for two diierent sub-logics, that if a process with a restricted form of parameterisation satisses a modal formula then this can be derived in the proof system. This is subject to the assumption that all auxiliary proof obligations concerning the data language can be discharged.
منابع مشابه
A Symbolic Framework for the Conformance Checking of Value-Passing Choreographies
Choreographies, thanks to their abstract and global perspective, are well-suited to the specification of distributed systems such as service compositions and collaborative business processes. Choreography conformance checking aims at verifying whether a set of distributed peers or local role specifications match a global specification. This activity is central in both top-down and bottom-up dev...
متن کاملLocal Model-Checking of an Alternation-Free Value-Based Modal Mu-Calculus
Programs written in value-passing description languages such as Crl and Lotos can be naturally translated into Labelled Transition Systems (Ltss) containing data values. In order to express temporal properties interpreted over these Ltss, we deene a value-based alternation-free modal-calculus built from typed variables, pattern-matching modalities, and parameterised xed point operators. The ver...
متن کاملModel Checking via ΓCFA
We present and discuss techniques for performing and improving the model-checking of higher-order, functional programs based upon abstract interpretation [4]. We use continuation-passing-style conversion to produce an abstractable state machine, and then utilize abstract garbage collection and abstract counting [9] to indirectly prune false branches in the abstract state-to-state transition gra...
متن کاملA Model Checking Language for Concurrent Value-Passing Systems
Modal μ-calculus is an expressive specification formalism for temporal properties of concurrent programs represented as Labeled Transition Systems (Ltss). However, its practical use is hampered by the complexity of the formulas, which makes the specification task difficult and error-prone. In this paper, we propose Mcl (Model Checking Language), an enhancement of modal μ-calculus with high-leve...
متن کاملModel Checking CSP Revisited: Introducing a Process Analysis Toolkit
FDR, initially introduced decades ago, is the de facto analyzer for Communicating Sequential Processes (CSP). Model checking techniques have been evolved rapidly since then. This paper describes PAT, i.e., a process analysis toolkit which complements FDR in several aspects. PAT is designed to analyze event-based compositional system models specified using CSP as well as shared variables and asy...
متن کامل